Dynamic Processor Allocation in Large Mesh-Connected Multicomputers
نویسندگان
چکیده
Current processor allocation techniques for highly parallel systems are based on centralized front-end based algorithms. As a result, the applied strategies are restricted to static allocation, low parallelism and weak fault tolerance. To lift these restrictions we are investigating a distributed approach to the processor allocation problem in large meshconnected multicomputers. A noncontiguous version of a distributed dynamic processor allocation strategy is proposed and studied in this paper as an alternative for parallel programming models that allow dynamic creation and deletion of tasks. Simulations compare the performance of the proposed dynamic strategy with the static counterpart and also with well-known centralized algorithms in such an environment with growing and shrinking processor demands. We also present the results of experiments on a Siemens hpcLine Primergy Server with 96 nodes that show dynamic allocation is feasible with current technologies.
منابع مشابه
Corner-Boundary Processor Allocation for 3D Mesh-Connected Multicomputers
This research paper presents a new contiguous allocation strategy for 3D mesh-connected multicomputers. The proposed strategy maintains a list of maximal free sub-meshes and gives priority to allocating corner and boundary free sub-meshes. The goal of corner and boundary allocation is to decrease the number of leftover free sub-meshes and increase their sizes, which is expected to reduce proces...
متن کاملImproving Performance of Mesh-connected Multicomputers by Reducing Fragmentation
Fragmentation is the main performance bottleneck of multicomputer systems. In this paper, we classify the fragmentation problems in multicomputer systems according to their causes. It is noted that among all kinds of fragmentation, physical fragmentation is seldom addressed by contemporary allocation schemes. Two novel processor allocation schemes that reduce physical fragmentation for the mesh...
متن کاملDynamic Scheduling and Allocation in Two-Dimensional Mesh-Connected Multicomputers for Real-Time Tasks∗
Among several multiprocessor topologies, twodimensional (2D) mesh topology has become popular due to its simplicity and efficiency. Even though a number of scheduling and processor allocation schemes for 2D meshes have been proposed in the literature, little study has been done aimed for realtime environment. In this paper, we propose an on-line scheduling and allocation scheme for real-time ta...
متن کاملA Fast and Efficient Strategy for Sub-mesh Allocation with Minimal Allocation Overhead in 3D Mesh Connected Multicomputers
This paper presents a fast and efficient contiguous allocation strategy for 3D mesh multicomputers, referred to as Turning Busy List (TBL for short), which can identify a free sub-mesh of the requested size as long as it exists in the mesh system. Turning means that the orientation of the allocation request is changed when no sub-mesh is available in the requested orientation. The TBL strategy ...
متن کامل